Pattern matching with pair correlation distance
نویسندگان
چکیده
منابع مشابه
Pattern Matching Using the Hausdorff Distance
Point matching can be a computationally intensive task, especially when large point sets are involved and when the transformation space has many degree of freedom. Here, we employ two efficient algorithms to solve the problem, in an attempt to reduce its computational complexity, while providing acceptable result. The first method is an approximation algorithm based on branch-and-bound approach...
متن کاملUsing Edit Distance in Point-Pattern Matching
Edit distance is a powerful measure of similarity in string matching, measuring the minimum amount of insertions, deletions, and substitutions to convert a string into another string. This measure is often contrasted with time warping in speech processing, that measures how close two trajectories are by allowing compression and expansion operations on time scale. Time warping can be easily gene...
متن کاملOnline Pattern Matching for String Edit Distance with Moves
Edit distance with moves (EDM) is a string-to-string distance measure that includes substring moves in addition to ordinal editing operations to turn one string to the other. Although optimizing EDM is intractable, it has many applications especially in error detections. Edit sensitive parsing (ESP) is an efficient parsing algorithm that guarantees an upper bound of parsing discrepancies betwee...
متن کاملThe Correlation Coefficient Technique for Pattern Matching
Introduction: The ability to track motion is essential for many MRI applications. Specific applications of interest in our lab include retrospective and prospective 2D navigator echo motion artifact correction as well as post-process image averaging[l]. Previous attempts at motion tracking can be broadly classified into: 1) phase-based subtraction or 2) image-based pattern matching techniques. ...
متن کاملMesh Pattern Recognition Using Correlation Matching Method,
In this paper, a novel method is proposed to recognize the type of mesh pattern synthesized in a binary text image. Since the pixels of mesh pattern are regularly arranged, it is intuitive to identify the type of mesh pattern by analyzing the regularity of black pixels in the considered image. To achieve the recognition goal, the coefficient of correlation between the input image and the mesh p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.08.023